Parikh Matrices and Strong M-Equivalence
نویسنده
چکیده
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M -equivalence is proposed as a canonical alternative to M -equivalence to get rid of this undesirable property. Some characterization of strong M -equivalence for a restricted class of words is obtained. Finally, the existential counterpart of strong M -equivalence is introduced as well.
منابع مشابه
Strong 2.t and Strong 3.t Transformations for Strong M-equivalence
Parikh matrices have been extensively investigated due to their usefulness in studying subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of the alphabet, strong M-equivalence was proposed as an order-independent alternative to M-equivalence in studying words possessing the same Parikh matrix. This paper introduces and studies the notions of strong (2 · t) an...
متن کاملRelations on words
In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our presentation tries to set up a unified framework with respect to a given binary relation. In the second part, we mainly focus on abelian equivalence, k-abelian equivale...
متن کاملCentric connectivity index by shell matrices
Relative centricity RC values of vertices/atoms are calculated within the Distance Detour and Cluj-Distance criteria on their corresponding Shell transforms. The vertex RC distribution in a molecular graph gives atom equivalence classes, useful in interpretation of NMR spectra. Timed by vertex valences, RC provides a new index, called Centric Connectivity CC, which can be useful in the topologi...
متن کاملParikh Matrices and Words over Tertiary Ordered Alphabet
Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word in terms of its sub words. It was introduced by Mateescu et al. in 2000. Since then it has been being studied for various ordered alphabets. In this paper Parikh Matrices over tertiary alphabet are investigated. Algorithm is developed to display Parikh Matrices of words over tertiary alphabet. T...
متن کاملStrong Shift Equivalence and the Generalized Spectral Conjecture for Nonnegative Matrices
Given matrices A and B shift equivalent over a dense subring R of R, with A primitive, we show that B is strong shift equivalent over R to a primitive matrix. This result shows that the weak form of the Generalized Spectral Conjecture for primitive matrices implies the strong form. The foundation of this work is the recent result that for any ring R, the group NK1(R) of algebraic K-theory class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 27 شماره
صفحات -
تاریخ انتشار 2016